On nondegenerate M-stationary points for sparsity constrained nonlinear optimization

نویسندگان

چکیده

Abstract We study sparsity constrained nonlinear optimization (SCNO) from a topological point of view. Special focus will be on M-stationary points Burdakov et al. (SIAM J Optim 26:397–425, 2016), also introduced as $$N^C$$ N C -stationary in Pan (J Oper Res Soc China 3:421–439, 2015). introduce nondegenerate and define their M-index. show that all are generically nondegenerate. In particular, the constraint is active at local minimizers generic SCNO. Some relations to other stationarity concepts, such S-stationarity, basic feasibility, CW-minimality, discussed detail. By doing so, issues instability degeneracy due different concepts highlighted. The concept M-stationarity allows adequately describe global structure SCNO along lines Morse theory. For that, we changes lower level sets while passing an point. As novelty for SCNO, multiple cells dimension equal M-index needed attached. This intriguing fact strong contrast with problems considered before, where just one cell suffices. consequence, derive relation which relates numbers one. appearance saddle cannot thus neglected perspective optimization. Due multiplicity phenomenon cell-attachment, may lead more than two minimizers. conclude relatively involved source well-known difficulty if solving optimality.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and coordinate-wise optimality. These conditions are then used to derive three numerical algorithms aimed at finding points satisfying the resulting optimality crite...

متن کامل

Convergence to Second Order Stationary Points in Inequality Constrained Optimization

We propose a new algorithm for the nonlinear inequality constrained minimization problem, and prove that it generates a sequence converging to points satisfying the KKT second order necessary conditions for optimality. The algorithm is a line search algorithm using directions of negative curvature and it can be viewed as a non trivial extension of corresponding known techniques from unconstrain...

متن کامل

On double-covering stationary points of a constrained Dirichlet energy

The double-covering map udc : R 2 → R is given by udc(x) = 1 √ 2|x| ( x2 2 − x12 2x1x2 ) in cartesian coordinates. This paper examines the conjecture that udc is the global minimizer of the Dirichlet energy I(u) = ∫ B |∇u| dx among allW 1,2 mappings u of the unit ball B ⊂ R satisfying (i) u = udc on ∂B, and (ii) det∇u = 1 almost everywhere. Let the class of such admissible maps be A. The chief ...

متن کامل

Inversion of Gravity Data by Constrained Nonlinear Optimization based on nonlinear Programming Techniques for Mapping Bedrock Topography

A constrained nonlinear optimization method based on nonlinear programming techniques has been applied to map geometry of bedrock of sedimentary basins by inversion of gravity anomaly data. In the inversion, the applying model is a 2-D model that is composed of a set of juxtaposed prisms whose lower depths have been considered as unknown model parameters. The applied inversion method is a nonli...

متن کامل

On the Use of Non-Stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's

In this paper we discuss the use of non-stationary penalty functions to solve general nonlinear programming problems (NP) using real-valued GAS. The non-stationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2021

ISSN: ['1573-2916', '0925-5001']

DOI: https://doi.org/10.1007/s10898-021-01070-7